Packing paths of length at least two

نویسندگان

  • Mikio Kano
  • Gyula Y. Katona
  • Zoltán Király
چکیده

We give a simple proof for Kaneko’s theorem which gives a su2cient and necessary condition for the existence of vertex disjoint paths in a graph, each of length at least two, that altogether cover all vertices of the original graph. Moreover we generalize this theorem and give a formula for the maximum number of vertices that can be covered by such a path system. c © 2004 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Parameterized Perspective on Packing Paths of Length Two

We study (vertex-disjoint) packings of paths of length two (i.e., of P2’s) in graphs under a parameterized perspective. Starting from a maximal P2-packing P of size j we use extremal combinatorial arguments for determining how many vertices of P appear in some P2-packing of size (j + 1) (if it exists). We prove that one can ’reuse’ 2.5j vertices. Based on a WIN-WIN approach, we build an algorit...

متن کامل

A nearly linear time algorithm for the half integral parity disjoint paths packing problem

We consider the following problem, which is called the half integral parity disjoint paths packing problem. Input: A graph G, k pair of vertices (s1, t1), (s2, t2), . . . , (sk, tk) in G (which are sometimes called terminals), and a parity li for each i with 1 ≤ i ≤ k, where li = 0 or 1. Output : Paths P1, . . . , Pk in G such that Pi joins si and ti for i = 1, 2, . . . , k and parity of length...

متن کامل

Packing A-paths in Group-Labelled Graphs via Linear Matroid Parity

Mader’s disjoint S-paths problem is a common generalization of matching and Menger’s disjoint paths problems. Lovász (1980) suggested a polynomial-time algorithm for this problem through a reduction to matroid matching. A more direct reduction to the linear matroid parity problem was given later by Schrijver (2003), which leads to faster algorithms. As a generalization of Mader’s problem, Chudn...

متن کامل

Experimental Study of Packing Time and Melt Temperature Effects on Shrinkage of a Thin Sheet Made of Wood-HDPE Composite

Injection molding is one of the most common processes which are used for manufacturing different plastic parts. This method includes 3 continuous steps: filling of the mold, cooling and driving the part out. A wide range of plastic and Non-Plastic materials can be used as raw material in this process. One of the most important advantages of this way of production is that it is very economic. In...

متن کامل

Experimental Study of Packing Time and Melt Temperature Effects on Shrinkage of a Thin Sheet Made of Wood-HDPE Composite

Injection molding is one of the most common processes which are used for manufacturing different plastic parts. This method includes 3 continuous steps: filling of the mold, cooling and driving the part out. A wide range of plastic and Non-Plastic materials can be used as raw material in this process. One of the most important advantages of this way of production is that it is very economic. In...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 283  شماره 

صفحات  -

تاریخ انتشار 2004